Ensemble Kalman filter based sequential Monte Carlo sampler for sequential Bayesian inference
نویسندگان
چکیده
Abstract Many real-world problems require one to estimate parameters of interest, in a Bayesian framework, from data that are collected sequentially time. Conventional methods for sampling posterior distributions, such as Markov chain Monte Carlo cannot efficiently address they do not take advantage the data’s sequential structure. To this end, which seek update distribution whenever new collection become available often used solve these types problems. Two popular choices method ensemble Kalman filter (EnKF) and sampler (SMCS). While EnKF only computes Gaussian approximation distribution, SMCS can draw samples directly posterior. Its performance, however, depends critically upon kernels used. In work, we present constructs using an formulation, demonstrate performance with numerical examples.
منابع مشابه
An Adaptive Sequential Monte Carlo Sampler
Sequential Monte Carlo (SMC) methods are not only a popular tool in the analysis of state–space models, but offer an alternative to Markov chain Monte Carlo (MCMC) in situations where Bayesian inference must proceed via simulation. This paper introduces a new SMC method that uses adaptive MCMC kernels for particle dynamics. The proposed algorithm features an online stochastic optimization proce...
متن کاملMassively Parallel Sequential Monte Carlo for Bayesian Inference
This paper reconsiders sequential Monte Carlo approaches to Bayesian inference in the light of massively parallel desktop computing capabilities now well within the reach of individual academics. It first develops an algorithm that is well suited to parallel computing in general and for which convergence results have been established in the sequential Monte Carlo literature but that tends to re...
متن کاملOnline Bayesian phylogenetic inference: theoretical foundations via Sequential Monte Carlo.
Phylogenetics, the inference of evolutionary trees from molecular sequence data such as DNA, is an enterprise that yields valuable evolutionary understanding of many biological systems. Bayesian phylogenetic algorithms, which approximate a posterior distribution on trees, have become a popular if computationally expensive means of doing phylogenetics. Modern data collection technologies are qui...
متن کاملBayesian Phylogenetic Inference using a Combinatorial Sequential Monte Carlo Method
The application of Bayesian methods to large scale phylogenetics problems is increasingly limited by computational issues, motivating the development of methods that can complement existing Markov Chain Monte Carlo (MCMC) schemes. Sequential Monte Carlo (SMC) methods are approximate inference algorithms that have become very popular for time series models. Such methods have been recently develo...
متن کاملSequential Monte Carlo for Bayesian Computation
Sequential Monte Carlo (SMC) methods are a class of importance sampling and resampling techniques designed to simulate from a sequence of probability distributions. These approaches have become very popular over the last few years to solve sequential Bayesian inference problems (e.g. Doucet et al. 2001). However, in comparison to Markov chain Monte Carlo (MCMC), the application of SMC remains l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2022
ISSN: ['0960-3174', '1573-1375']
DOI: https://doi.org/10.1007/s11222-021-10075-x